Geographical Cluster based Routing with Guaranteed Delivery
نویسنده
چکیده
Exploring the faces of a planar graph is a prominent approach to recover from routing failures which may occur during geographic greedy forwarding heuristics. A recently studied variant of planar graph based recovery, termed geographical cluster based routing, performs face exploration along the edges of an overlay graph instead of using the network links directly. For this routing variant it has been observed, that there exist node placements which result in a connected physical network while any planar overlay graph which is constructed by simply removing edges from that graph is disconnected. This article for the first time describes a technique to locally construct an overlay graph which is both planar and connected. In addition we present a generic routing framework which is based on the overlay graph introduced in this work. In contrast to existing planar graph routing techniques the described framework allows major flexibility regarding the possible next hop candidate nodes. The framework is envisioned to serve as an interesting starting point for future performance measurements of a multitude of its possible instances.
منابع مشابه
Arithmetic Geographical Coding And Routing
In this thesis we study two research aspects of geographical routing: efficient geographical addressing and a new routing scheme. In the first part we offer a novel geographical routing algorithm that relies on a well known data structure called Quadtree. Quadtree is an efficient method of mapping a twodimensional area by recursively partitioning it to disjoint squares. We present a greedy, gua...
متن کاملCluster-Based Online Routing Protocols for Ad Hoc Network
In geographical routing algorithms, mobile nodes rely on geographical position to make routing judgments. Researchers frequently discuss such routing algorithms in (2D) space. However, in reality, mobile nodes spread in (3D) space. In this paper the authors present four new 3D geographical-based routing algorithms Cylinder, Greedy-Cylinder, Cluster-Cylinder, and Greedy-cluster-Cylinder. In Cyli...
متن کاملOn the Necessary and Sufficient Condition of Greedy Routing Supporting Geographical Data Networks
Large scale decentralized communication systems have introduced the new trend towards online routing where routing decisions are performed based on a limited and localized knowledge of the network. Geometrical greedy routing has been among the simplest and most common online routing schemes. A perfect geometrical routing scheme is expected to deliver each packet to the point in the network that...
متن کاملAnalyses of Energy-Aware Geographic Routing Protocols for Wireless Sensor Networks
In this paper, we analyze energy-aware geographical routing protocols with different parameters in wireless sensor networks. Geographic routing is a forwarding protocol that relies on geographic-position information. It is an on-demand type of routing that uses a “greedy” forwarding approach, in which a sensor node forwards a packet to a neighbor closest to the destination node. We study, throu...
متن کاملThe Bi-Objective Location-Routing Problem based on Simultaneous Pickup and Delivery with Soft Time Window
The location-routing problem is the most significant and yet new research field in location problems that considers simultaneously vehicle routing problem features with original one for achieving high-quality integrated distribution systems in beside of the global optimum. Simultaneous pickup and delivery based on time windows are the two main characteristics of logistic management that have be...
متن کامل